Aggregates in Constraint Handling Rules
نویسندگان
چکیده
Aggregates. We propose an extension of CHR with aggregate expressions in the heads of rules. Aggregates accumulate information over possibly unbounded parts of the constraint store. We provide a wide range of predefined aggregates, including all aggregates commonly found in related paradigms such as database query languages [1] (i.e. min, max, sum, count and avg) and production rule systems (i.e. not, exists and forall). The complete list of predefined aggregates, together with a number of example uses, can be found in [5].
منابع مشابه
Aggregates for Constraint Handling Rules
We extend the Constraint Handling Rules language with aggregates such as sum, count, findall, and min. The proposed extension features nested aggregate expressions over guarded conjunctions of constraints, a series of predefined aggregates, and application-tailored user-defined aggregates. We formally define the operational semantics of aggregates, and show how incremental aggregate computation...
متن کاملExtension and Implementation of CHR
AGGREGATES: •J. Sneyers, P. Van Weert, and T. Schrijvers. Aggregates for Constraint Handling Rules. In Proc. 4th Intl. Workshop on Constraint Handling Rules, Porto, Portugal, pp.91-105, 2007 •P. Van Weert, J. Sneyers, and B. Demoen. Aggregates for CHR through Program Transformation. In LOPSTR '07: 17th Intl. Symp. Logic-Based Program Synthesis and Transformation, Revised Selected Papers, volume...
متن کاملAggregates in CHR
We propose an extension of the Constraint Handling Rules language with aggregates like sum, count, findall, and min in the heads of rules. We define the semantics of aggregate expressions formally and informally. Our prototype implementation allows nested aggregate expressions over guarded conjunctions of constraints, using either an ondemand or an incremental computation strategy. Case studies...
متن کاملAggregates for CHR through Program Transformation
We propose an extension of Constraint Handling Rules (CHR) with aggregates such as sum, count, findall, and min. This new feature significantly improves the conciseness and expressiveness of the language. In this paper, we describe an implementation based on source-to-source transformations to CHR (extended with some low-level compiler directives). We allow user-defined aggregates and nested ag...
متن کاملProgramming in Constraint Handling Rules
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint programming language, developed in the 1990s for the implementation of constraint solvers. It is traditionally an extension to other programming languages – especially constraint logic programming languages – but has been used increasingly as a general-purpose programming language in the recent past. With CHR, one can sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007